Equality propositional logic and its extensions

نویسندگان

  • X. L. Gao School of Mathematics, Northwest University, Xi'an,710127, China
  • X. L. Xin School of Mathematics, Northwest University, Xi'an,710127, China
چکیده مقاله:

We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such as Modus Ponens(MP) rule, Hypothetical Syllogism(HS) rule and completeness, etc. Especially, we provide two ways to prove the completeness of this logic system. We also introduce two extensions of equality propositional logic. The first one is involutive equality propositional logic, which is equality propositional logic with double negation. The second one adds prelinearity which is rich enough to enjoy the strong completeness property. Finally, we introduce additional connective $Delta$(delta) in equality propositional logic and demonstrate that the resulting logic holds soundness and completeness.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Transforming equality logic to propositional logic

We investigate and compare various ways of transforming equality formulas to propositional formulas, in order to be able to solve satisfiability in equality logic by means of satisfiability in propositional logic. We propose equality substitution as a new approach combining desirable properties of earlier methods, we prove its correctness and show its applicability by experiments.

متن کامل

Deciding Effectively Propositional Logic with Equality

Effectively Propositional Logic (EPR), also known as the Bernays-Schönfinkel class, allows encoding problems that are propositional in nature, but EPR encodings can be exponentially more succinct than purely propositional logic encodings. We recently developed a DPLL-based decision procedure that builds on top of efficient SAT solving techniques to handle the propositional case efficiently whil...

متن کامل

Epistemic extensions of combined classical and intuitionistic propositional logic

Logic L was introduced by Lewitzka [8] as a modal system that combines intuitionistic and classical logic: L is a conservative extension of CPC and it contains a copy of IPC via embedding φ 7→ φ. In this article, we consider L3, i.e. L augmented with S3 modal axioms, define basic epistemic extensions and prove completeness w.r.t. algebraic semantics. Our systems involve, in adapted form, some o...

متن کامل

Propositional mixed logic: its syntax and semantics

In this paper, we present a propositional logic (called mixed logic) containing disjoint copies of minimal, intuitionistic and classical logics. We prove a completeness theorem for this logic with respect to a Kripke semantics. We establish some relations between mixed logic and minimal, intuitionistic and classical logics. We present at the end a sequent calculus version for this logic.

متن کامل

Extensions of the ℵ0-Valued Lukasiewicz Propositional Logic

MV-algebras were introduced by Chang in 1958 preliminary to his providing an algebraic completeness proof for the K0-vaΓued Lukasiewicz propositional logic, LXo. In this paper a method is given for determining, for an arbitrary normal extension of LKo, an MV-algebra characteristic for the extension. The characteristic algebras are finite direct products of two sets of linearly ordered MV-algebr...

متن کامل

Solving Satisfiability in Ground Logic with Equality by Efficient Conversion to Propositional Logic

Ground Logic with Equality (GL) is a subset of First-Order Logic (FOL) in which functions or quantifiers are excluded, but equality is preserved. We argue about GL’s unique position (in terms of expressiveness and ease of decidability) between FOL and Propositional Logic (PL). We aim to solve satisfiability (SAT) problems formulated in GL by converting them into PL using a satisfiability-preser...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


عنوان ژورنال

دوره 16  شماره 5

صفحات  125- 137

تاریخ انتشار 2019-10-01

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023